Optimal intervention in transportation networks

We study a network design problem (NDP) where the planner aims at selecting optimal single-link intervention on transportation to minimize travel time under Wardrop equilibrium flows. Our first result is that, if delay functions are affine and support of not modified with interventions, NDP may be formulated in terms electrical quantities computed related resistor network. In particular, we show that variation corresponding an given link depends effective resistance between endpoints link. suggest approach approximate such by performing only local computation, exploit it efficient algorithm solve NDP. discuss optimality this procedure limit infinitely large networks, provide sufficient condition for its optimality. then numerical simulations, showing our achieves good performance even varies non-linear.